Model-bounded Monitoring of Hybrid Systems
نویسندگان
چکیده
Monitoring of hybrid systems attracts both scientific and practical attention. However, monitoring algorithms suffer from the methodological difficulty only observing sampled discrete-time signals, while real behaviors are continuous-time signals. To mitigate this problem sampling uncertainties, we introduce a model-bounded scheme, where use prior knowledge about target system to prune interpolation candidates. Technically, express such by linear automata (LHAs)—the LHAs called bounding models . We novel notion monitored language LHAs, reduce membership language. present two partial algorithms—one is via reduction reachability in other direct one using polyhedra—and show that these methods, thus proposed efficient practically relevant.
منابع مشابه
CEGAR Based Bounded Model Checking of Discrete Time Hybrid Systems
Many hybrid systems can be conveniently modeled as Piecewise Affine Discrete Time Hybrid Systems PA-DTHS. As well known Bounded Model Checking (BMC) for such systems comes down to solve a Mixed Integer Linear Programming (MILP) feasibility problem. We present a SAT based BMC algorithm for automatic verification of PA-DTHSs. Using Counterexample Guided Abstraction Refinement (CEGAR) our algorith...
متن کاملEfficient Proof Engines for Bounded Model Checking of Hybrid Systems
In this paper we present HySat, a new bounded model checker for linear hybrid systems, incorporating a tight integration of a DPLL–based pseudo–Boolean SAT solver and a linear programming routine as core engine. In contrast to related tools like MathSAT, ICS, or CVC, our tool exploits all of the various optimizations that arise naturally in the bounded model checking context, e.g. isomorphic re...
متن کاملOptimizing Bounded Model Checking for Linear Hybrid Systems
Bounded model checking (BMC) is an automatic verification method that is based on a finite unfolding of the system’s transition relation. BMC has been successfully applied, in particular, for discovering bugs in digital system design. Its success is based on the effectiveness of state-of-the-art satisfiability solvers that are used to check for a finite unfolding whether a violating state is re...
متن کاملMemory-aware Bounded Model Checking for Linear Hybrid Systems
Bounded Model Checking (BMC) is a successful method for refuting properties of erroneous systems. Initially applied to discrete systems only, BMC could be extended to more complex domains like linear hybrid automata. The increasing complexity coming along with these complex models, but also recent optimizations of SAT-based BMC, like excessive conflict learning, reveal a memory explosion proble...
متن کاملSReach: A Bounded Model Checker for Stochastic Hybrid Systems
In this paper we describe a new tool, SReach, which solves probabilistic bounded reachability problems for two classes of stochastic hybrid systems. The first one is (nonlinear) hybrid automata with parametric uncertainty. The second one is probabilistic hybrid automata with additional randomness for both transition probabilities and variable resets. Standard approaches to reachability problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Cyber-Physical Systems
سال: 2022
ISSN: ['2378-962X', '2378-9638']
DOI: https://doi.org/10.1145/3529095